An Improved Upper Bound for SAT
نویسندگان
چکیده
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1/α) up to a polynomial factor, where α = ln(m/n) + O(ln lnm) and n, m are respectively the number of variables and the number of clauses in the input formula. This bound is asymptotically better than the previously best known 2n(1−1/ log(2m)) bound for SAT.
منابع مشابه
The SAT-UNSAT transition in the adversarial SAT problem
Adversarial SAT (AdSAT) is a generalization of the satisfiability (SAT) problem in which two players try to make a boolean formula true (resp. false) by controlling their respective sets of variables. AdSAT belongs to a higher complexity class in the polynomial hierarchy than SAT and therefore the nature of the critical region and the transition are not easily paralleled to those of SAT and wor...
متن کاملImproved Bounds for Exact Counting of Satisfiability Solutions
An algorithm is presented for exactly solving (in fact, counting) the number of maximum weight satisfying assignments of a 2-SAT formula. The worst case running time of O(1.2461) for formulas with n variables improves on the previous bound of O(1.2561) by Dahllöf, Jonsson, and Wahlström. The weighted 2-SAT counting algorithm can be applied to obtain faster algorithms for combinatorial counting ...
متن کاملA Study of Precision Forging of Steel Spur Gears: Upper Bound Model and Experiments
Precision forging process is widely used for the production of spur gears due to its advantages such as improved strength and surface finish, little waste of materials and reduction in the machining time of the gear. An important aspect of precision forging process is the load required to perform the process successfully and design the forging tools. In this research, a new kinematically admiss...
متن کاملSatisfiability-unsatisfiability transition in the adversarial satisfiability problem.
Adversarial satisfiability (AdSAT) is a generalization of the satisfiability (SAT) problem in which two players try to make a Boolean formula true (resp. false) by controlling their respective sets of variables. AdSAT belongs to a higher complexity class in the polynomial hierarchy than SAT, and therefore the nature of the critical region and the transition are not easily parallel to those of S...
متن کاملA framework for good SAT translations, with applications to CNF representations of XOR constraints
We present a general framework for “good CNF-representations” of boolean constraints, to be used for translating decision problems into SAT problems (i.e., deciding satisfiability for conjunctive normal forms). We apply it to the representation of systems of XOR-constraints (“exclusive-or”), also known as systems of linear equations over the two-element field, or systems of parity constraints, ...
متن کاملA better upper bound for the unsatisfiability threshold
Let be a random Boolean formula that is an instance of 3-SAT. We consider the problem of computing the least real number such that if the ratio of the number of clauses over the number of variables of strictly exceeds , then is almost certainly unsatissable. By a well known and more or less straightforward argument, it can be shown that 5:191. This upper bound was improved by Kamath, Motwani, P...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره شماره
صفحات -
تاریخ انتشار 2005